package algorithms.leecode;

public class Au105 {
 public class TreeNode {
      int val;
     TreeNode left;
      TreeNode right;
    TreeNode() {}
     TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
       this.right = right;
    }
}

    public TreeNode buildTree(int[] preorder, int[] inorder) {
return null;
    }



}
